Harris Recurrence of Metropolis-Within-Gibbs and Trans-Dimensional Markov Chains
نویسندگان
چکیده
A φ-irreducible and aperiodic Markov chain with stationary probability distribution will converge to its stationary distribution from almost all starting points. The property of Harris recurrence allows us to replace “almost all” by “all,” which is potentially important when running Markov chain Monte Carlo algorithms. Full-dimensional Metropolis–Hastings algorithms are known to be Harris recurrent. In this paper, we consider conditions under which Metropolis-withinGibbs and trans-dimensional Markov chains are or are not Harris recurrent. We present a simple but natural two-dimensional counterexample showing how Harris recurrence can fail, and also a variety of positive results which guarantee Harris recurrence. We also present some open problems. We close with a discussion of the practical implications for MCMC algorithms.
منابع مشابه
Markov chains for exploring posterior distributions " by LukeTierney
We congratulate Luke Tierney for this paper, which even before its appearance has done a valuable service in clarifying both theory and practice in this important area. For example, the discussion of combining strategies in Section 2.4 helped researchers break away from pure Gibbs sampling in 1991; it was, for example, part of the reasoning that lead to the \Metropolis-coupled" scheme of Geyer ...
متن کاملMcmc Using Graphical Models
Markov chain Monte Carlo techniques have revolutionized the field of Bayesian statistics. Their enormous power and their generalizability have rendered them the method of choice for statistical inference in many scientific disciplines. Their power is so great that they can even accommodate situations in which the structure of the statistical model itself is uncertain. However, the analysis of s...
متن کاملMonte Carlo Methods and Bayesian Computation: MCMC
Markov chain Monte Carlo (MCMC) methods use computer simulation of Markov chains in the parameter space. The Markov chains are defined in such a way that the posterior distribution in the given statistical inference problem is the asymptotic distribution. This allows to use ergodic averages to approximate the desired posterior expectations. Several standard approaches to define such Markov chai...
متن کاملSome Multi-step Coupling Constructions for Markov Chains
We describe some old and new methods for coupling the flow of a discrete time Markov chain, provided its transition function is known. Examples including Hastings-Metropolis and Gibbs samplers are given.
متن کاملClassification of chirp signals using hierarchical Bayesian learning and MCMC methods
This paper addresses the problem of classifying chirp signals using hierarchical Bayesian learning together with Markov chain Monte Carlo (MCMC) methods. Bayesian learning consists of estimating the distribution of the observed data conditional on each class from a set of training samples. Unfortunately, this estimation requires to evaluate intractable multidimensional integrals. This paper stu...
متن کامل